A quadratically convergent VBSCF method.
نویسندگان
چکیده
A quadratically convergent valence bond self-consistent field method is described where the simultaneous optimisation of orbitals and the coefficients of the configurations (VB structures) is based on a Newton-Raphson scheme. The applicability of the method is demonstrated in actual calculations. The convergence and efficiency are compared with the Super-CI method. A necessary condition to achieve convergence in the Newton-Raphson method is that the Hessian is positive definite. When this is not the case, a combination of the Super-CI and Newton-Raphson methods is shown to be an optimal choice instead of shifting the eigenvalues of the Hessian to make it positive definite. In the combined method, the first few iterations are performed with the Super-CI method and then the Newton-Raphson scheme is switched on based on an internal indicator. This approach is found computationally a more economical choice than using either the Newton-Raphson or Super-CI method alone to perform a full optimisation of the nonorthogonal orbitals.
منابع مشابه
A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملA globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization
A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization Paul Armand & Riadh Omheni To cite this article: Paul Armand & Riadh Omheni (2015): A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization, Optimization Methods and Software, DOI: 10.1080/10556788.2015.1025401 ...
متن کاملApproximate Zeros of Quadratically Convergent Algorithms
Smale's condition for a point to be an approximate zero of a function for Newton's method is extended to the general quadratically convergent iterative algorithm. It is shown in which way the bound in the condition is affected by the characteristics of the algorithm. This puts the original condition of Smale for Newton's method in a more general perspective. The results are also discussed in th...
متن کاملA quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
In this paper we propose a quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomialmapwhere theNewtonmethod is used to solve an equivalent system of nonlinear equations. The semi-symmetric tensor is introduced to reveal the relation between homogeneous polynomial map and its associated semi-symmetric tensor. Based on this relation a globally ...
متن کاملA quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
A predictor-corrector method for solving linear programs from infeasible starting points is analyzed. The method is quadratically convergent and can be combined with Ye's finite termination scheme under very general assumptions. If the starting points are large enough then the algorithm has O(nL) iteration complexity. If the ratio between feasibility and optimality at the starting points is sma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Journal of chemical physics
دوره 138 5 شماره
صفحات -
تاریخ انتشار 2013